27. Remove Element - LeetCode Solution


Array Two pointer

Python Code:

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        count = len(nums)
        if len(nums) == 0:
            return 0
        
        
        
        ptr1 = 0
        ptr2 = len(nums) -1
        
        for i in range(len(nums)):
            if nums[i] == val:
                count-=1
        
        while ptr1 != ptr2:
            if nums[ptr1] == val:
                nums[ptr1] , nums[ptr2] = nums[ptr2], nums[ptr1]
                ptr2-=1
     
            else:
                ptr1+=1
                
                
                
        
        return count
        


Comments

Submit
0 Comments
More Questions

1213A - Chips Moving
490A - Team Olympiad
233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation
893C - Rumor
227B - Effective Approach
1534B - Histogram Ugliness
1611B - Team Composition Programmers and Mathematicians
110A - Nearly Lucky Number
1220B - Multiplication Table
1644A - Doors and Keys
1644B - Anti-Fibonacci Permutation
1610A - Anti Light's Cell Guessing
349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room
230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps